Iterative Soft Permutation Decoding of Product Codes
نویسندگان
چکیده
منابع مشابه
Iterative Soft Permutation Decoding of Product Codes
In this paper the performance of product codes based on quadratic residue codes is investigated. Our Proposed Iterative decoding SISO based on a soft permutation decoding algorithm (SPDA) as a component decoder. Numerical result for the proposed algorithm over Additive White Gaussian Noise (AWGN) channel is provided. Results show that the turbo effect of the proposed decoder algorithm is establ...
متن کاملIterative Decoding Algorithms for Turbo Product Codes
In this paper we introduce the iterative decoding principle, “the turbo principle”, for the bidimensional Turbo Product Codes (TPC’s). The constituent codes used for encoding on rows and columns are two concatenated (7,4) Hamming block codes. Several Soft Input Soft Output (SISO) algorithms can be used for the iterative decoding process. At each iteration, the two decoders decode all rows, then...
متن کاملSoft-Output Decoding Algorithms in Iterative Decoding of Turbo Codes
In this article, we present two versions of a simplified maximum a posteriori decoding algorithm. The algorithms work in a sliding window form, like the Viterbi algorithm, and can thus be used to decode continuously transmitted sequences obtained by parallel concatenated codes, without requiring code trellis termination. A heuristic explanation is also given of how to embed the maximum a poster...
متن کاملIterative Algebraic Soft Decision Decoding of Reed-Solomon Codes
In this paper, we propose an iterative soft decision decoding scheme for Reed Solomon codes with near maximum likelihood performance. The advantage of this decoding algorithm over previously proposed algorithms is its fast convergence in terms of the number of iterations required. This is achieved by combining two powerful soft decision decoding techniques which were previously regarded in the ...
متن کاملIterative Least-Squares Decoding of Analog Product Codes
We define analog product codes as a special case of analog parallel concatenated codes. These codes serve as a tool to get some more insight into the convergence of “Turbo” decoding. We prove that the iterative “Turbo”-like decoding of analog product codes indeed is an estimation in the least-squares sense and thus correspond to the optimum maximum-likelihood decoding.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer and Information Science
سال: 2016
ISSN: 1913-8997,1913-8989
DOI: 10.5539/cis.v9n1p128